Approximation algorithm for the L1-fitting circle problem
نویسنده
چکیده
In this paper, we study the problem of L1-fitting a circle to a set of points in the plane, where the target function is the sum of distances of the points to the circle. We show an (1 + ε)-approximation algorithm, with running time O(n + poly(log n, 1/ε)), where poly(log n, 1/ε) is a constant degree polynomial in log n and 1/ε. This is the first subquadratic algorithm for this problem.
منابع مشابه
A near-linear algorithm for projective clustering integer points
We consider the problem of projective clustering in Euclidean spaces of non-fixed dimension. Here, we are given a set P of n points in R and integers j ≥ 1, k ≥ 0, and the goal is to find j k-subspaces so that the sum of the distances of each point in P to the nearest subspace is minimized. Observe that this is a shape fitting problem where we wish to find the best fit in the L1 sense. Here we ...
متن کاملPropagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملWeighted isotonic regression under the L1 norm
Isotonic regression, the problem of finding values that best fit given observations and conform to specific ordering constraints, has found many applications in biomedical research and other fields. When the constraints form a partial ordering, solving the problem under the L1 error measure takes O(n) when there are n observations. The analysis of large-scale microarray data, which is one of th...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملError analysis for circle fitting algorithms
We study the problem of fitting circles (or circular arcs) to data points observed with errors in both variables. A detailed error analysis for all popular circle fitting methods – geometric fit, K̊asa fit, Pratt fit, and Taubin fit – is presented. Our error analysis goes deeper than the traditional expansion to the leading order. We obtain higher order terms, which show exactly why and by how m...
متن کامل